/*
  Sorting Algorithms
  Copyright (C) 2021  YangJie <yangjie98765@yeah.net>

  This program is free software; you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation; either version 2 of the License, or
  (at your option) any later version.

  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.

  You should have received a copy of the GNU General Public License along
  with this program; if not, write to the Free Software Foundation, Inc.,
  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/

#ifndef __J_SORT_H
#define __J_SORT_H

#include <_types.h>

void __sort_bubble(ds_data_t* a, ds_size_t size, __comp __comp);
void sort_bubble(ds_data_t* a, ds_size_t size, __comp __comp);
void __sort_insert(ds_data_t* a, ds_size_t size, __comp __comp);
void sort_insert(ds_data_t* a, ds_size_t size, __comp __comp);
void __sort_heap(ds_data_t* a, ds_size_t size, __comp __comp);
void sort_heap(ds_data_t* a, ds_size_t size, __comp __comp);
void __sort_quick(ds_data_t* a, ds_size_t size, __comp __comp);
void sort_quick(ds_data_t* a, ds_size_t size, __comp __comp);

#endif /* __J_SORT_H */
